Additive Combinatorics and its Applications in Theoretical Computer Science (draft)
نویسنده
چکیده
منابع مشابه
Additive Combinatorics and its Applications in Theoretical Computer Science
Additive combinatorics (or perhaps more accurately, arithmetic combinatorics) is a branch of mathematics which lies at the intersection of combinatorics, number theory, Fourier analysis and ergodic theory. It studies approximate notions of various algebraic structures, such as vector spaces or fields. In recent years, several connections between additive combinatorics and theoretical computer s...
متن کاملAdditive Combinatorics and Theoretical Computer Science ∗ Luca Trevisan
Additive combinatorics is the branch of combinatorics where the objects of study are subsets of the integers or of other abelian groups, and one is interested in properties and patterns that can be expressed in terms of linear equations. More generally, arithmetic combinatorics deals with properties and patterns that can be expressed via additions and multiplications. In the past ten years, add...
متن کاملAn Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem
The polynomial Freiman-Ruzsa conjecture is one of the most important conjectures in additive combinatorics. It asserts that one can switch between combinatorial and algebraic notions of approximate subgroups with only a polynomial loss in the underlying parameters. This conjecture has also found several applications in theoretical computer science. Recently, Tom Sanders proved a weaker version ...
متن کاملAdditive Combinatorics: With a View Towards Computer Science and Cryptography - An Exposition
Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define – perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which are used there. One might say that additive combinatorics is a branch of mathematics concerning the study of additive structures in sets equipped with a grou...
متن کاملPaul Erdős and Probabilistic Reasoning
One of the major contributions of Paul Erdős is the development of the Probabilistic Method and its applications in Combinatorics, Graph Theory, Additive Number Theory and Combinatorial Geometry. This short paper describes some of the beautiful applications of the method, focusing on the long-term impact of the work, questions and results of Erdős. This is mostly a survey, but it contains a few...
متن کامل